t=int(input())
for _ in range(t):
n=input()
def solve(n):
if int(n[-1])%2==0:
return 0
if int(n[0])%2==0:
return 1
for i in n:
if int(i)%2==0:
return 2
return -1
print(solve(n))
#include <bits/stdc++.h>
using namespace std;
int main(){
ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
//freopen("input.txt","r",stdin);
//freopen("output.txt","w",stdout);
int T;
cin>>T;
for(int t=0;t<T;t++){
string s;
cin>>s;
int n=s.size();
int l=int(s[n-1])-48;
if(l%2==0){
cout<<0<<endl;
}else {
int f=int(s[0])-48;
if(f%2==0){
cout<<1<<endl;
}else{
int b=1;
for(int i=0;i<n;i++){
int tmp=int(s[i])-48;
if(tmp%2==0){
b=0;
}
}
if(b==0){
cout<<2<<endl;
}else cout<<-1<<endl;
}
}
}
return 0;
}
1302. Deepest Leaves Sum | 1209. Remove All Adjacent Duplicates in String II |
994. Rotting Oranges | 983. Minimum Cost For Tickets |
973. K Closest Points to Origin | 969. Pancake Sorting |
967. Numbers With Same Consecutive Differences | 957. Prison Cells After N Days |
946. Validate Stack Sequences | 921. Minimum Add to Make Parentheses Valid |
881. Boats to Save People | 497. Random Point in Non-overlapping Rectangles |
528. Random Pick with Weight | 470. Implement Rand10() Using Rand7() |
866. Prime Palindrome | 1516A - Tit for Tat |
622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |